Variance-covariance matrix estimation with LSQR in a parallel programming environment
نویسندگان
چکیده
Knowledge about the gravity eld allows an insight into the structure and dynamics of the earth. It provides the geoid as the most important physical reference surface in geodesy and oceanography. Since 2000, the CHAMP (CHallenging Mini-satellite Payload) mission detects the structure of the global gravity eld, followed by the launch of GRACE (Gravity Recovery And Climate Experiment) in 2002. In 2008, nally, the GOCE (Gravity eld and steady-state Ocean Circulation Explorer) satellite is supposed to be set in orbit. These missions demonstrate satellite-based gravity eld recovery to be at the center of geo-scienti c interest. Interpretation and evaluation of satellite observations are di cult, especially the determination of the unknown gravity eld parameters from a huge amount of measurements. Because of the immense demand for memory and computing time, the occurring systems of equations pose a real numerical challenge. Therefore, High-Performance Computing (HPC) is commonly adopted to overcome computational problems. Basically, parallel programming with MPI and OpenMP routines allows to speed up the solution process considerably. In this thesis, rstly global gravity eld modelling by means of satellite observations is reviewed. Secondly, the LSQR method (Least-Squares using QR factorization) is introduced in detail in order to solve the resulting least-squares problems. Because the LSQR method is an iterative solver, it basically can not provide the variance-covariance information of the parameter estimate. To investigate the approximate computation of the variance-covariance matrix, two methods are introduced. The rst one is based on the generalized inverse of the design matrix. The second approach applies Monte-Carlo integration techniques. Because parallel programming is very helpful to implement such iterative methods, it is necessary to introduce some basic principles and concepts about HPC.
منابع مشابه
Implementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملRobust Inverse Covariance Estimation under Noisy Measurements
This paper proposes a robust method to estimate the inverse covariance under noisy measurements. The method is based on the estimation of each column in the inverse covariance matrix independently via robust regression, which enables parallelization. Different from previous linear programming based methods that cannot guarantee a positive semi-definite covariance matrix, our method adjusts the ...
متن کاملA Scalable Parallel LSQR Algorithm for Solving Large-Scale Linear System for Tomographic Problems: A Case Study in Seismic Tomography
Least Squares with QR-factorization (LSQR) method is a widely used Krylov subspace algorithm to solve sparse rectangular linear systems for tomographic problems. Traditional parallel implementations of LSQR have the potential, depending on the non-zero structure of the matrix, to have significant communication cost. The communication cost can dramatically limit the scalability of the algorithm ...
متن کاملAn MPI-CUDA Implementation and Optimization for Parallel Sparse Equations and Least Squares (LSQR)
LSQR (Sparse Equations and Least Squares) is a widely used Krylov subspace method to solve large-scale linear systems in seismic tomography. This paper presents a parallel MPI-CUDA implementation for LSQR solver. On CUDA level, our contributions include: (1) utilize CUBLAS and CUSPARSE to compute major steps in LSQR; (2) optimize memory copy between host memory and device memory; (3) develop a ...
متن کاملCovariance Estimation: The GLM and Regularization Perspectives
Finding an unconstrained and statistically interpretable reparameterization of a covariance matrix is still an open problem in statistics. Its solution is of central importance in covariance estimation, particularly in the recent high-dimensional data environment where enforcing the positive-definiteness constraint could be computationally expensive. We provide a survey of the progress made in ...
متن کامل